Compact Identity Based Encryption from LWE
نویسندگان
چکیده
We construct an identity-based encryption (IBE) scheme from the standard Learning with Errors (LWE) assumption that has compact public-key and achieves adaptive security in the standard model. In particular, our scheme only needs 2 public matrices to support O(log λ)-bit length identity, and O(λ/ log λ) public matrices to support λ-bit length identity. This improves over previous IBE schemes from lattices substantially. Additionally, our techniques from IBE can be adapted to construct a compact digital signature scheme, which achieves existential unforgeability under the standard Short Integer Solution (SIS) assumption with small polynomial parameters.
منابع مشابه
Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
In this paper, we present two new adaptively secure identity-based encryption (IBE) schemes from lattices. The size of the public parameters, ciphertexts, and private keys are Õ(nκ), Õ(n), and Õ(n) respectively. Here, n is the security parameter, κ is the length of the identity, and d ∈ N is a flexible constant that can be set arbitrary (but will affect the reduction cost). Ignoring the poly-lo...
متن کاملNew cryptographic constructions using generalized LWE
We present first a generalized LWE problem, which is essentially to extend the original LWE to the case of matrices. Then we use this new version of LWE problem, which we call matrix LWE problem to build new cryptographic schemes, which include a new key distribution scheme, a new key exchanges scheme and a new simple identity-based encryption scheme.
متن کاملFully-Secure Lattice-Based IBE as Compact as PKE
We construct an identity-based encryption (IBE) scheme from the standard Learning with Errors (LWE) assumption, which both has a compact public-key (with size similar to known lattice-based PKE schemes) and also achieves adaptive security in the standard model. This improves over previous IBE schemes from lattices, which either have a public key that grows at least linearly with the length of t...
متن کاملHardness of decision (R)LWE for any modulus
The decision Learning With Errors problem has proven an extremely flexible foundation for devising provably secure cryptographic primitives. LWE can be expressed in terms of linear algebra over Z/qZ. This modulus q is the subject of study of the present work. When q is prime and small, or when it is exponential and composite with small factors, LWE is known to be at least as hard as standard wo...
متن کاملCompact-LWE: Enabling Practically Lightweight Public Key Encryption for Leveled IoT Device Authentication
Leveled authentication allows resource-constrained IoT devices to be authenticated at different strength levels according to the particular types of communication. To achieve efficient leveled authentication, we propose a lightweight public key encryption scheme that can produce very short ciphertexts without sacrificing its security. The security of our scheme is based on the Learning With Sec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016